An Efficient Incremental Clustering Method for Incremental Cloud Data

نویسندگان

  • S. Nikkath Bushra
  • A. Chandra Sekar
چکیده

Cloud Computing is a technology that uses the internet and central remote servers to maintain data and applications. Cloud computing allows consumers and businesses to use applications without installation and access their personal files at any computer with internet access. This technology allows for much more efficient computing by centralizing data storage, processing and bandwidth. Typically, the data sets in these applications are anonymized using K-anonymity to assert the privacy of data owners but the privacy requirements can be violated when new data join over time. Traditional clustering algorithms are static in nature .In this paper new ways of Incremental clustering algorithms are discussed. This algorithm clusters data in dynamic form. The database is assumed to be clustered initially and every new element is added as without need of changing existing clustered database. Keywords— IGCA, Incremental Clustering, Anonymization, k-anonimity, Genetic clustering

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Framework for Building an Efficient Incremental Intrusion Detection System

In this paper, a boosting-based incremental hybrid intrusion detection system is introduced. This system combines incremental misuse detection and incremental anomaly detection. We use boosting ensemble of weak classifiers to implement misuse intrusion detection system. It can identify new classes types of intrusions that do not exist in the training dataset for incremental misuse detection. As...

متن کامل

An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering

Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.

متن کامل

Efficient Incremental Density Based Algorithm using Boltzmann Learning Technique for Large Data Sets

In dynamic information environment, such as web the amount of information is rapidly increasing. Thus it will be need of time that we step towards incremental clustering algorithm rather than traditional algorithm. In this paper, an enhanced version of incremental density based and competent incremental density based clustering algorithm have been introduced. This paper reveals a good clusterin...

متن کامل

Modification of the Fast Global K-means Using a Fuzzy Relation with Application in Microarray Data Analysis

Recognizing genes with distinctive expression levels can help in prevention, diagnosis and treatment of the diseases at the genomic level. In this paper, fast Global k-means (fast GKM) is developed for clustering the gene expression datasets. Fast GKM is a significant improvement of the k-means clustering method. It is an incremental clustering method which starts with one cluster. Iteratively ...

متن کامل

Finite element simulation of two-point incremental forming of free-form parts

Two-point incremental forming method is considered a modern technique for manufacturing shell parts. The presence of bottom punch during the process makes this technique far more complex than its conventional counterpart i.e. single-point incremental forming method. Thus, the numerical simulation of this method is an essential task, which leads to the reduction of trial/error costs, predicts th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014